A single-exponential FPT algorithm for the K4-minor cover problem
نویسندگان
چکیده
منابع مشابه
A single - exponential FPT algorithm for the K 4 - minor cover problem ∗ Eun
Given an input graph G and an integer k, the parameterized K4-minor cover problem askswhether there is a set S of at most k vertices whose deletion results in a K4-minor-free graph,or equivalently in a graph of treewidth at most 2. This problem is inspired by two well-studiedparameterized vertex deletion problems, Vertex Cover and Feedback Vertex Set, whichcan also be expressed ...
متن کاملA Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem
Given an input graph G and an integer k, the parameterized K4-minor cover problem askswhether there is a set S of at most k vertices whose deletion results in a K4-minor-free graph,or equivalently in a graph of treewidth at most 2. This problem is inspired by two well-studiedparameterized vertex deletion problems, Vertex Cover and Feedback Vertex Set, whichcan also be expressed ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSingle Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem
Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a single exponential FPT algorithm with running time O(cn(n+m)), c = min{18, k} that turns graph G into an interval graph by deleting at most k vertices from G. This solves an open problem posed by Marx [19]. We also provide a single exponential FPT algorithm with running time O(cn(n + m)), c = min{17...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2015
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2014.05.001